Fast , Long - Lived Renaming ( Extended
نویسنده
چکیده
We consider wait-free solutions to the renaming problem for shared-memory multiprocessing systems 3, 5]. In the renaming problem, processes are required to choose new names in order to reduce the size of their name space. Previous solutions to the renaming problem have time complexity that is dependent on the size of the original name space, and allow processes to acquire names only once. In this paper, we present several new renaming algorithms. Most of our algorithms have time complexity that is independent of the size of the original name space, and some of our algorithms solve a new, more general version of the renaming problem called long-lived renaming. In long-lived renaming algorithms, processes may repeatedly acquire and release names.
منابع مشابه
Fast, Long-Lived Renaming Improved and Simpli ed
In the long-lived M-renaming problem, N processes repeatedly acquire and release names ranging over f0;:::;M ? 1g, where M < N. It is assumed that at most k M processes concurrently request or hold names. EEcient solutions to the long-lived renaming problem can be used to improve the performance of applications in which processes repeatedly perform computations whose time complexity depends on ...
متن کاملReference M Time Complexity Space Complexity Fast ? Long
In the long-lived M-renaming problem, N processes repeatedly acquire and release names ranging over f0; :::;M?1g, where M < N. It is assumed that at most k processes concurrently request or hold names. EEcient solutions to the long-lived renaming problem can be used to improve the performance of applications in which processes repeatedly participate in a computation whose time complexity depend...
متن کاملFast, Long-Lived Renaming
We consider wait-free solutions to the renaming problem for shared-memory multiprocessing systems [3, 5]. In the renaming problem, processes are required to choose new names in order to reduce the size of their name space. Previous solutions to the renaming problem have time complexity that is dependent on the size of the original name space, and allow processes to acquire names only once. In t...
متن کاملLong-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput
The (n; k; l)-renaming problem requires that names from the set f1; : : : ; lg are assigned to processes from a set of size n, provided that no more than k l processes are simultaneously either holding or trying to acquire a name. A solution to this problem supplies a renaming object supporting both acquire and release operations so that no two processes ever simultaneously hold the same name. ...
متن کاملWait-Free Algorithms for Fast, Long-Lived Renaming
We consider wait-free solutions to the renaming problem for shared-memory multiprocessing systems [3, 5]. In the renaming problem, processes are required to choose new names in order to reduce the size of their name space. Previous solutions to the renaming problem have time complexity that is dependent on the size of the original name space, and allow processes to acquire names only once. In t...
متن کامل